package jvm.com.cj.p1;

import jdk.nashorn.internal.ir.LoopNode;
import sun.awt.image.ImageWatched;

import javax.naming.ldap.PagedResultsControl;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

/**
 * @author caojie
 * @version 1.0
 * @Description
 * @date 2023/8/3 9:39
 */
// -Xms20m -Xmx20m -XX:+HeapDumpOnOutOfMemoryError
public class Test1 {

    class UnionFind{
        Map<Integer,Integer> parent;

        public UnionFind(int[] nums) {
            parent = new HashMap<>();
            for (int i = 0; i < nums.length; i++) {
                parent.put(nums[i],nums[i]);
            }
        }
        public Integer find(int x){
            if(!parent.containsKey(x)){
               return null;
            }
            while(x!= parent.get(x)){
                x = parent.get(x);
            }
            return x;
        }
        public void union(int x,int y){
            int rootX = find(x);
            int rootY = find(y);
            if(rootX==rootY){
                return;
            }
            parent.put(rootX,rootY);
        }
    }
    class UnionFind2{
        int[] parent;
        int size ;
        public UnionFind2(int n) {
            parent = new int[n];
            for (int i = 0; i < n; i++) {
                parent[i] = i;
            }
            size = n;
        }
        public Integer find(int x){
            if(parent[x] == x){
                return x;
            }
            return find(parent[x]);

        }
        public void union(int x,int y){
            int rootX = find(x);
            int rootY = find(y);
            if(rootX==rootY){
                return;
            }
            size--;
            parent[rootX] = rootY;
        }
    }
    static class OMMObject{

    }
    public class LinkNode{
        public LinkNode pre;
        public LinkNode next;
        public int val;

        public LinkNode(int val) {
            this.val = val;
        }
    }
    public class Node{
        public Node next;
        public Node pre;
        public int val;

        public Node(int val) {
            this.val = val;
        }
    }
    void test1(){
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = scanner.nextInt();
        }
        scanner.nextLine();
        int a = scanner.nextInt();
        int b = scanner.nextInt();
        LinkNode root = new LinkNode(0);
        LinkNode tail = root;
        for (int i = 0; i < n; i++) {
            LinkNode p = new LinkNode(arr[i]);
            tail.next = p;
            p.pre = tail;
            tail = p;
        }
        root = root.next;
        while(root!=null){
            if(root.val==a && (root.pre.val == b || (root.next!=null && root.next.val==b))){
                System.out.println("Yes");
                return;
            }
            root = root.next;
        }
        System.out.println("No");
    }
    void test2(){
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = scanner.nextInt();
        }
        scanner.nextLine();
        int a = scanner.nextInt();
        int b = scanner.nextInt();

        int sum = 0;
        for (int i = 0; i < n; i++) {
            sum+=arr[i];
        }
        if(a>b){
            int temp = a;
            a = b;
            b= temp;
        }
        int res = 0;
        for (int i = a; i<b; i++) {
            res+=arr[i-1];
        }
        System.out.println(Math.min(res,sum-res));

    }

    int[][] prefixSum(int[][] arr){
        int n = arr.length;
        int m = arr[0].length;
        int[][] prefixArr = new int[n][m];
        prefixArr[0][0] = arr[0][0];
        for (int i = 1; i < m; i++) {
            prefixArr[0][i] = prefixArr[0][i-1]+arr[0][i];
        }
        for (int i = 1; i < n; i++) {
            prefixArr[i][0] = prefixArr[i-1][0]+arr[i][0];
        }
        for (int i = 1; i < n; i++) {
            for (int j = 1; j < m; j++) {
                prefixArr[i][j] = prefixArr[i-1][j] + prefixArr[i][j-1] - prefixArr[i-1][j-1] + arr[i][j];
            }
        }
        return prefixArr;
    }
    //    5 1 4
    //    1 1 4
//      5 6 10
//      6 8 16
//    16-10
//    16-6
//    16-8
    void test3(){
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int m = scanner.nextInt();
        int[][] arr = new int[n][m];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                int num = scanner.nextInt();
                arr[i][j] = num;
            }
            scanner.nextLine();
        }
        int[][] prefixArr = prefixSum(arr);
        long res = Long.MAX_VALUE;
        for (int i = 1; i < n; i++) {
            res = Math.min(res,Math.abs(prefixArr[i][m-1]-(prefixArr[n-1][m-1]-prefixArr[i][m-1])));
        }
        for (int i = 1; i < m; i++) {
            res = Math.min(res,Math.abs(prefixArr[n-1][i]-(prefixArr[n-1][m-1]-prefixArr[n-1][i])));
        }
        System.out.println(res);
//        2 3
//        1
//        1
        int c=1;
    }
//    [0,3,7,2,5,8,4,6,0,1]
//    [100,4,200,1,3,2]
    void test4a(int[] numbers){
        UnionFind unionFind = new UnionFind(numbers);
        int ans = 0;
        for (int number : numbers) {
            if(unionFind.find(number+1)!=null){
                unionFind.union(number,number+1);
            }
        }
        for (int number : numbers) {
            int right = unionFind.find(number);
            ans = Math.max(ans,right - number+1);
        }
        System.out.println(ans);
        int c = 1;
    }
//    1-2-4
//      3-4
//    100-100
//    200-200
//      01 3 6
//    aababbabb
//    aab
//    abb
//    abb
    int [] p;
    void test4(){
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        scanner.nextLine();
        String s = scanner.nextLine();
        int res = Integer.MAX_VALUE;
        for (int i = 1; i < n/2; i++) {
            int x = i;
            int y = n/x;
            if(x*y!=n){
                continue;
            }
            char[][] cA = new char[x][y];
            for (int j = 0; j < x; j++) {
                for (int k = 0; k < y; k++) {
                    cA[j][k] = s.charAt(j*y+k);
                }
            }
            UnionFind2 unionFind = new UnionFind2(n);
            for (int j = 0; j < x; j++) {
                for (int k = 0; k < y; k++) {
                    dfs(cA,j,k,x,y,unionFind);
                }
            }
            res = Math.min(unionFind.size,res);

        }
        System.out.println(res);
        int c=1;
    }
    int[] dx ={1,-1,0,0};
    int[] dy ={0,0,1,-1};
    void dfs(char[][] cA,int x,int y,int m,int n,UnionFind2 unionFind){
        if(x<0 || y<0 ||x>=m || y >=n){
            return;
        }
        char temp = cA[x][y];
        for (int k = 0; k < 4; k++) {
            int x1 = dx[k]+x;
            int y1 = dy[k]+y;
            if(x1>=0 && x1<m && y1>=0 && y1<n){
                if(temp == cA[x1][y1]){
                    unionFind.union(x*n+y,x1*n+y1);
                }
            }
        }

    }

    void test5(){

        for (int i = 627945; i <=629393 ; i++) {
            System.out.println("kill "+ i+";");
        }
//        dp[u][0] = Math.max(dp[v][0], dp[v][1]);
//        dp[u][1] = Math.max(dp[u][1],(dp[u][0] - Math.max(dp[v][0],dp[v][1])+dp[v][0] + 2) );
    }
    public static void main(String[] args) {
        Test1 test = new Test1();
//        test.test4a(new int[]{100,4,200,1,3,2});
//        test.prefixSum(new int[][]{{0,1,2},{5,6,7},{10,11,12}});
          test.test5();
    }


}
